RUNMON-RIFT: Adaptive configuration and healing for large-scale parameter inference
نویسندگان
چکیده
Gravitational wave parameter inference pipelines operate on data containing unknown sources, and run distributed hardware with widely varying configurations stochastic transient errors. For one specific analysis pipeline (RIFT), we have developed a flexible tool (RUNMON-RIFT) to mitigate the most common challenges introduced by uncertainties in source parameters computational hardware. On hand, RUNMON provides mechanisms adjust pipeline-specific settings, including prior ranges, ensure completes encompasses physical parameters. other, it tools for identifying adjusting realities of uncertainties. We demonstrate both general features controlled examples.
منابع مشابه
Large-scale Network Parameter Configuration Using On-line Simulation Framework
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vi
متن کاملAn adaptive modified firefly algorithm to unit commitment problem for large-scale power systems
Unit commitment (UC) problem tries to schedule output power of generation units to meet the system demand for the next several hours at minimum cost. UC adds a time dimension to the economic dispatch problem with the additional choice of turning generators to be on or off. In this paper, in order to improve both the exploitation and exploration abilities of the firefly algorithm (FA), a new mo...
متن کاملA limited memory adaptive trust-region approach for large-scale unconstrained optimization
This study concerns with a trust-region-based method for solving unconstrained optimization problems. The approach takes the advantages of the compact limited memory BFGS updating formula together with an appropriate adaptive radius strategy. In our approach, the adaptive technique leads us to decrease the number of subproblems solving, while utilizing the structure of limited memory quasi-Newt...
متن کاملStatistical Inference for Large Scale Data
We introduce a sparse and positive definite estimator of the covariance matrix designed for high-dimensional situations in which the variables have a known ordering. Our estimator is the solution to a convex optimization problem that involves a hierarchical group lasso penalty. We show how it can be efficiently computed, compare it to other methods such as tapering by a fixed matrix, and develo...
متن کاملMultivariate Hawkes Processes for Large-Scale Inference
In this paper, we present a framework for fitting multivariate Hawkes processes for large-scale problems, both in the number of events in the observed history n and the number of event types d (i.e. dimensions). The proposed Scalable LowRank Hawkes Process (SLRHP) framework introduces a lowrank approximation of the kernel matrix that allows to perform the nonparametric learning of the d trigger...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Astronomy and Computing
سال: 2023
ISSN: ['2213-1345', '2213-1337']
DOI: https://doi.org/10.1016/j.ascom.2022.100664